Knowledge-Based Control Systems via Internet Part I. Applications in Biotechnology

An extensive approach towards the dissemination of expert knowledge and coordination efforts to distributed points and seamless integration of control strategies applied to distributed yet identical systems is crucial to enhance overall efficiency and operational costs. Application of Knowledge-Based Control System via Internet will be very efficient especially in biotechnology, because many industrial bioprocesses, based on the same technological principles, are distributed in the whole world. Brewing industry oriented practical solutions illustrate this approach

AI-based Diagnostics for Fault Detection and Isolation in Process Equipment Service

Recent industry requires efficient fault discovering and isolation solutions in process equipment service. This problem is a real-world problem of typically ill-defined systems, hard to model, with large-scale solution spaces. Design of precise models is impractical, too expensive, or often non-existent. Support service of equipment requires generating models that can analyze the equipment data, interpreting the past behavior and predicting the future one. These problems pose a challenge to traditional modeling techniques and represent a great opportunity for the application of AI-based methodologies, which enable us to deal with imprecise, uncertain data and incomplete domain knowledge typically encountered in real-world applications. In this paper the state of the art, theoretical background of conventional and AI-based techniques in support of service tasks and illustration of some applications to process equipment service on bio-ethanol production process are shortly described

Validation of the Substance Use Risk Profile Scale (SURPS) With Bulgarian Substance Dependent Individuals

Background: The Substance Use Risk Profile Scale (SURPS) is a 23-item self-report questionnaire that assesses four well-validated personality risk factors for substance misuse (Impulsivity, Sensation Seeking, Anxiety Sensitivity, and Hopelessness). While the SURPS has been used extensively with adolescents at risk for substance dependence, its properties with adult substance-dependent populations have been understudied. Further, the validity of the Bulgarian version of the SURPS has not been evaluated. The aims of the present study were to examine the factor structure of the Bulgarian version of the SURPS, its psychometric properties, and its ability to distinguish individuals with substance dependence from healthy controls.Methods: Participants included 238 individuals ages 18 to 50 (45% female): 36 “pure” (i.e., mono-substance dependent) heroin users, 34 “pure” amphetamine users, 32 polysubstance users, 64 controls with no history of substance dependence, 43 unaffected siblings of heroin users, and 29 unaffected siblings of amphetamine users. We explored the factor structure of the Bulgarian version of the SURPS with confirmatory factor analyses, examined its reliability and validity, and tested for group differences between substance dependent and non-dependent groups.Results: Confirmatory factor analyses (CFA) replicated the original four-factor model of the SURPS. The four subscales of the SURPS demonstrated good internal consistency (Cronbach's alphas ranged from 0.71 to 0.85) and adequate concurrent validity. Significant group differences were found on the Impulsivity and Sensation Seeking subscales, with the three substance dependent groups scoring higher than controls.Conclusions: The SURPS is a valid instrument for measuring personality risk for substance use disorders in the Bulgarian population. The Bulgarian version of the SURPS demonstrates adequate to good reliability, concurrent validity, and predictive validity. Its ability to distinguish between groups with and without a history of substance dependence was specific to externalizing traits such as Impulsivity and Sensation Seeking, on which opiate, stimulant, and polysubstance dependent individuals scored higher than non-dependent controls

Space and time complexity of algorithmic problems in groups

We prove that the problem of deciding whether or not two group elements are conjugate can be solved using a logarithmic amount of space for the following groups: Grigorchuk's group, free solvable groups and the wreath product of two groups having log-space decidable conjugacy problems. We show that in free metabelian groups every element can be rewritten into a unique normal form in logarithmic space. Additionally, we show that the Magnus embedding, which embeds a free solvable group in the wreath product of a free abelian group with a free solvable group of lesser degree, is a quasi-isometric embedding.On prouve que le problème de conjugaison dans les groupes suivants peut être résolu en n'utilisant qu'un espace logarithmique: le groupe de Grigorchuk, les groupes solubles libres et les produits en couronne de deux groupes dans lesquels le problème de conjugaison peut être résolu en espace logarithmique. On démontre aussi que tout élément d'un groupe métabelien libre peut être réécrit en tant que forme normale unique. De plus, on démontre que le plongement de Magnus, qui permet de voir un groupe soluble libre en tant que sous-groupe d'un produit en couronne d'un groupe abélien libre et d'un groupe soluble libre de moindre degré, est une quasi-isométrie

The word and conjugacy problems in classes of solvable groups

This thesis is a survey of certain algorithmic problems in group theory and their computational complexities. In particular, it consists of a detailed review of the decidability and complexity of the word and conjugacy problems in several classes of solvable groups, followed by two original results. The first result states that the Conjugacy Problem in wreath products which satisfy certain elementary conditions is decidable in polynomial time. It is largely based on work by Jane Matthews, published in 1969. The second result, based on ideas of Remeslennikov and Sokolov (1970), and Myasnikov, Roman'kov, Ushakov and Vershik (2008) gives a uniform polynomial time algorithm to decide the Conjugacy Problem in free solvable groups.Cette thèse est une synthèse de certains problèmes algorithmiques dans la thèoriedes groupes et leur complexité computationnelle. Plus particulièrement, elle présenteune revue détaillée de la décidabilité et de la complexité des problèmes du mot et dela conjugaison dans plusieurs classes de groupes solubles, suivie de deux nouveauxrésultats. Le premier résultat énonce que le problème de la conjugaison dans lesproduits couronne qui satisfont certaines conditions élémentaires est décidable entemps polynomial. Elle part d'une publication de Jane Matthews (1969). Le deuxièmerésultat, basé sur des idées de Remeslennikov et Sokolov (1970) et de Myasnikov, Roman'kov,Ushakov et Vershik (2008), présente un algorithme en temps polynomial uniformepour décider le problème de conjugaison dans les groupes solubles libres